|
In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of union is one of the axioms of Zermelo–Fraenkel set theory, stating that, for any set ''x'' there is a set ''y'' whose elements are precisely the elements of the elements of ''x''. Together with the axiom of pairing this implies that for any two sets, there is a set that contains exactly the elements of both. == Formal statement == In the formal language of the Zermelo–Fraenkel axioms, the axiom reads: : or in words: :Given any set ''A'', there is a set ''B'' such that, for any element ''c'', ''c'' is a member of ''B'' if and only if there is a set ''D'' such that ''c'' is a member of ''D'' and ''D'' is a member of ''A''. or, more simply: :For any set , there is a set which consists of just the elements of the elements of that set. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Axiom of union」の詳細全文を読む スポンサード リンク
|